Nested Graphs: A Graph-based Knowledge Representation Model with FOL Semantics
نویسندگان
چکیده
We present a graph-based KR model issued from Sowa's conceptual graphs but studied and developed with a speci c approach. Formal objects are kinds of labelled graphs, which may be simple graphs or nested graphs. The fundamental notion for doing reasonings, called projection (or subsumption), is a kind of labelled graph morphism. Thus, we propose a graphical KR model, where \graphical " is used in the sense of [Sch91], i.e. a model that \uses graph-theoretic notions in an essential and nontrivial way". Indeed, morphism, which is the fundamental notion for any structure, is at the core of our theory. We de ne two rst order logic semantics, which correspond to di erent intuitive semantics, and prove in both cases that projection is sound and complete with respect to deduction. This paper is almost identical to the paper appeared in the KR'98 proceedings. It provides mi-
منابع مشابه
Extensions of Simple Conceptual Graphs: the Complexity of Rules and Constraints
Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homomorphism called projection, whose semantics is usually given in terms of positive, conjunctive, existential FOL. We present here a family of extensions of this model, based on rules and constraints, keeping graph homom...
متن کاملUnderstanding the semantics of conceptual graphs
In this paper, we propose a simple and well established semantics for conceptual graphs. This model theoretic semantics is an alternative to previous approaches, where a game theoretical semantics has been suggested. In addition to that, we thoroughly compare conceptual graphs with First Order Predicate Logic (FOPL). The comparison is based on semantics. Based on this comparison, we present som...
متن کاملA Simulation of Co-identity with Rules in Simple and Nested Graphs
Equality of markers ajid co-reference links have always been a convenient way to denote that two concept nodes represent the same entity in conceptual graphs. This is the underlying cause of counterexamples to projection completeness with respect to these graphs FOL semantics. Several algorithms and semantics have been proposed to achieve completeness, but they do not always suit &a application...
متن کاملSimple Conceptual Graphs and Simple Concept Graphs
Sowa’s Conceptual Graphs and Formal Concept Analysis have been combined into another knowledge representation formalism named Concept Graphs. In this paper, we compare Simple Conceptual Graphs with Simple Concept Graphs, by successively studying their different syntaxes, semantics, and entailment calculus. We show that these graphs are almost identical mathematical objects, have equivalent sema...
متن کاملRepresenting Multi-scale Datalog +/- Using Hierarchical Graphs
We introduce a multi scale knowledge representation and reasoning formalism of Datalog+/knowledge bases. This is de ned on a novel graph transformation system that highlights a new type of rendering based on the additional expansion of relation nodes. Querying and integration capabilities of our approach are based on a FOL sound and complete homomorphism.
متن کامل